Fitting Sharp Features with Loop Subdivision Surfaces
نویسندگان
چکیده
Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively deals with shapes with sharp features, that is, creases, darts and corners. We present an effective method for fitting a Loop subdivision surface to a dense triangle mesh with sharp features. Our contribution is a new exact evaluation scheme for the Loop subdivision with all types of sharp features, which enables us to compute a fitting Loop subdivision surface for shapes with sharp features in an optimization framework. With an initial control mesh obtained from simplifying the input dense mesh using QEM, our fitting algorithm employs an iterative method to solve a nonlinear least squares problem based on the squared distances from the input mesh vertices to the fitting subdivision surface. This optimization framework depends critically on the ability to express these distances as quadratic functions of control mesh vertices using our exact evaluation scheme near sharp features. Experimental results are presented to demonstrate the effectiveness of the method.
منابع مشابه
Surfaces Representation with Sharp Features Using Sqrt(3) and Loop Subdivision Schemes
This paper presents a hybrid algorithm that combines features form both Sqrt(3) and Loop Subdivision schemes. The algorithm aims at preserving sharp features and trim regions, during the surfaces subdivision, using a set of rules. The implementation is nontrivial due to the computational, topological, and smoothness constraints, which should be satisfied by the underlying surface. The fundament...
متن کاملREVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES
Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...
متن کاملSubdivision Surface Simplification
A modified quadric error metric (QEM) for simplification of Loop subdivision surfaces is presented. The suggested error metric not only measures the geometric difference but also controls the smoothness and well-shapedness of the triangles that result from the decimation process. Minimizing the error with respect to the original limit surface, our method allows for drastic simplification of Loo...
متن کاملSemi-sharp subdivision surface fitting based on feature lines approximation
This paper presents an algorithm for approximating arbitrary polygonal meshes with subdivision surfaces, with the objective of preserving the relevant features of the object while searching the coarsest possible control mesh. The main idea is to firstly extract the feature lines of the object, and secondly construct the subdivision surface over this network. Control points are created by approx...
متن کاملLoop Subdivision Surface Fitting by Geometric Algorithms
This paper describes a method to approximate point sets by Loop subdivision surfaces based on geometric algorithms. We assume that the data points are given in triangular mesh of arbitrary topological type. The initial control mesh of the Loop subdivision surface is obtained by simplifying the input triangular mesh using QEM algorithm. Our algorithm iteratively updates the control mesh in a glo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 27 شماره
صفحات -
تاریخ انتشار 2008